Fair On-Line Auctions without Special Trusted Parties
نویسندگان
چکیده
Traditional face-to-face (English) auctions rely on the auctioneer to fairly interact with bidders to accept the highest bid on behalf of the seller. On-line auctions also require fair negotiation. However, unlike face-to-face auctions, on-line auctions are inherently subject to attacks because the bidders and auctioneer are not copresent. These attacks include selectively blocking bids based on the bidder and amount and selectively closing the auction after a particular bid is received. In this paper, we present an on-line English auction in which bids are processed fairly and the auction closes fairly without specialized trusted parties. In particular, there is no need to trust the auctioneer to obtain a fair outcome to the auction.
منابع مشابه
Veriiable Escrowed Signature
We combine a publicly veriiable encryption technique and a Schnorr type signature scheme to achieve a veriiable escrowed signature scheme. The scheme allows a signer to convince a veriier the validity of a signature without letting him see the signature value. The unavailable but veriiable signature is encrypted under a public key of someone (e.g., a trusted third party) who stays oo-line. The ...
متن کاملA Fair-Exchange Protocol Based on Off-line Semi-Trusted Third Party
The fairness of data exchange becomes a key factor for the transaction over the Internet. To ensure the fairness of data exchange, the protocol needs a trusted third party be a judge when the dispute occurs, and has to give a guarantee to main parties during the data exchange. To eliminate the third party’s connectional time and enhance its security, a fair-exchange protocol based on off-line s...
متن کاملOptimal Fair Computation
A computation scheme among n parties is fair if no party obtains the computation result unless all other n− 1 parties obtain the same result. A fair computation scheme is optimistic if n honest parties can obtain the computation result without resorting to a trusted third party. We prove, for the first time, a tight lower bound on the message complexity of optimistic fair computation for n part...
متن کاملPractical Implementations of a Non-disclosure Fair Contract Signing Protocol
Contract signing is a practical application of the fair exchange of digital signatures. This application used to be realized by directly adopting the results of the fair exchange of signatures, which do not completely meet the requirements of the signing of a secret contract. The assistance of a trusted third party (TTP) and some cryptographic technology are required to allow two parties to exc...
متن کاملA traceable optimistic fair exchange protocol in the standard model
An Optimistic Fair Exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted third party, named arbitrator, which involves in the protocol if it is necessary. But there is a security problem when a...
متن کامل